constraint relationの例文

例文

もっと例文:   1  2

1. Satisfiability can sometimes be established by enforcing a form of local consistency and then checking the existence of an empty domain or constraint relation.
2. This is in general a correct but incomplete unsatisfiability algorithm : a problem may be unsatisfiable even if no empty domain or constraint relation is produced.
3. Research has shown a number of tractable subcases, some limiting the allowed constraint relations, some requiring the scopes of constraints to form a tree, possibly in a reformulated version of the problem.
4. Most classes of CSPs that are known to be tractable are those where the hypergraph of constraints has bounded treewidth ( and there are no restrictions on the set of constraint relations ), or where the constraints have arbitrary form but there exist essentially non-unary polymorphisms of the set of constraint relations.